top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Computer Algebra in Scientific Computing [[electronic resource] ] : 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings / / edited by François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov
Computer Algebra in Scientific Computing [[electronic resource] ] : 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings / / edited by François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov
Autore Boulier François
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource (XVII, 644 p. 96 illus.)
Disciplina 512.00285
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Artificial intelligence
Computer systems
Mathematics of Computing
Artificial Intelligence
Computer System Implementation
ISBN 3-030-60026-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Tropical Geometry of Biological Systems (Invited Talk) -- Algebraic and Geometric Analysis of Singularities of Implicit Differential Equations (Invited Talk) -- On the Complexity of Computing Integral Bases of Function Fields -- Truncated and Infinite Power Series in the Role of Coefficients of Linear Ordinary Differential Equations -- On Periodic Approximate Solutions of the Three-Body Problem Found by Conservative Difference Schemes -- Univariate Polynomials With Long Unbalanced Coefficients as Bivariate Balanced Ones: a Toom–Cook Multiplication Approach -- Power Series Arithmetic with the BPAS Library -- Enhancements to Lazard's Method for Cylindrical Algebraic Decomposition -- The Complexity and Parallel Implementation of two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization -- The GPGCD Algorithm with the Bézout Matrix -- On Parametric Linear System Solving -- Symbolic-Numeric Algorithm for Computing Orthonormal Basis of O(5) Χ SU(1,1) Group -- Symbolic-Numeric Study of Geometric Properties of Adiabatic Waveguide Modes -- Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases -- On the Study of the Motion of a System of Two Connected Rigid Bodies by Computer Algebra Methods -- Complexity Estimates for Fourier-Motzkin Elimination -- Progress Report on the Scala Algebra System -- Routh – Hurwitz Stability of a Polynomial Matrix Family. Real Perturbations -- Hermite Rational Function Interpolation with Error Correction -- Good Pivots for Small Sparse Matrices -- Nullstellensatz-Proofs for Multiplier Verification -- "Mathemachines" via LEGO, GeoGebra and CindyJS -- Balanced NUCOMP -- Contact Linearizability of Scalar Ordinary Differential Equations of Arbitrary Order -- Faster Numerical Univariate Polynomial Root-Finding by Means of Subdivision Iterations -- Computing Parametric Standard bases for Semi-weighted Homogeneous Isolated Hypersurface Singularities -- Acceleration of Subdivision Root-Finding for Sparse Polynomials -- Analytical Computations in Studying Translational-Rotational Motion of a Non-Stationary Triaxial Body in the Central Gravitational Field -- A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks -- First-Order Tests for Toricity -- Looking for Compatible Routes in the Railway Interlocking System of an Overtaking Station Using a Computer Algebra System -- Computing Logarithmic Vector Fields along an ICIS Germ via Matlis Duality -- Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers -- Symbolic-Numeric Computation of the Bernstein Coefficients of a Polynomial from Those of One of Its Partial Derivatives and of the Product of Two Polynomials -- Comparative Study of the Accuracy of Higher-order Difference Schemes for Molecular Dynamics Problems Using the Computer Algebra Means -- Characterizing Triviality of the Exponent Lattice of a Polynomial through Galois and Galois-Like Groups.
Record Nr. UNISA-996418283103316
Boulier François  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computer Algebra in Scientific Computing [[electronic resource] ] : 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings / / edited by François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov
Computer Algebra in Scientific Computing [[electronic resource] ] : 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings / / edited by François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov
Autore Boulier François
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource (XVII, 644 p. 96 illus.)
Disciplina 512.00285
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Artificial intelligence
Computer systems
Mathematics of Computing
Artificial Intelligence
Computer System Implementation
ISBN 3-030-60026-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Tropical Geometry of Biological Systems (Invited Talk) -- Algebraic and Geometric Analysis of Singularities of Implicit Differential Equations (Invited Talk) -- On the Complexity of Computing Integral Bases of Function Fields -- Truncated and Infinite Power Series in the Role of Coefficients of Linear Ordinary Differential Equations -- On Periodic Approximate Solutions of the Three-Body Problem Found by Conservative Difference Schemes -- Univariate Polynomials With Long Unbalanced Coefficients as Bivariate Balanced Ones: a Toom–Cook Multiplication Approach -- Power Series Arithmetic with the BPAS Library -- Enhancements to Lazard's Method for Cylindrical Algebraic Decomposition -- The Complexity and Parallel Implementation of two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization -- The GPGCD Algorithm with the Bézout Matrix -- On Parametric Linear System Solving -- Symbolic-Numeric Algorithm for Computing Orthonormal Basis of O(5) Χ SU(1,1) Group -- Symbolic-Numeric Study of Geometric Properties of Adiabatic Waveguide Modes -- Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases -- On the Study of the Motion of a System of Two Connected Rigid Bodies by Computer Algebra Methods -- Complexity Estimates for Fourier-Motzkin Elimination -- Progress Report on the Scala Algebra System -- Routh – Hurwitz Stability of a Polynomial Matrix Family. Real Perturbations -- Hermite Rational Function Interpolation with Error Correction -- Good Pivots for Small Sparse Matrices -- Nullstellensatz-Proofs for Multiplier Verification -- "Mathemachines" via LEGO, GeoGebra and CindyJS -- Balanced NUCOMP -- Contact Linearizability of Scalar Ordinary Differential Equations of Arbitrary Order -- Faster Numerical Univariate Polynomial Root-Finding by Means of Subdivision Iterations -- Computing Parametric Standard bases for Semi-weighted Homogeneous Isolated Hypersurface Singularities -- Acceleration of Subdivision Root-Finding for Sparse Polynomials -- Analytical Computations in Studying Translational-Rotational Motion of a Non-Stationary Triaxial Body in the Central Gravitational Field -- A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks -- First-Order Tests for Toricity -- Looking for Compatible Routes in the Railway Interlocking System of an Overtaking Station Using a Computer Algebra System -- Computing Logarithmic Vector Fields along an ICIS Germ via Matlis Duality -- Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers -- Symbolic-Numeric Computation of the Bernstein Coefficients of a Polynomial from Those of One of Its Partial Derivatives and of the Product of Two Polynomials -- Comparative Study of the Accuracy of Higher-order Difference Schemes for Molecular Dynamics Problems Using the Computer Algebra Means -- Characterizing Triviality of the Exponent Lattice of a Polynomial through Galois and Galois-Like Groups.
Record Nr. UNINA-9910427704403321
Boulier François  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui